Visualization of Fuzzy Clustering Result in Metric Space

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order intervals in the metric space of fuzzy numbers

In this paper, we introduce a function in order to measure the distancebetween two order intervals of fuzzy numbers, and show that this function isa metric. We investigate some properties of this metric, and finally presentan application. We think that this study could provide a more generalframework for researchers studying on interval analysis, fuzzy analysis andfuzzy decision making.

متن کامل

System of fuzzy fractional differential equations in generalized metric space

In this paper, we study the existence of integral solutions of fuzzy fractional differential systems with nonlocal conditions under Caputo generalized Hukuhara derivatives. These models are considered in the framework of completegeneralized metric spaces in the sense of Perov. The novel feature of our approach is the combination of the convergentmatrix technique with Schauder fixed point princi...

متن کامل

A Result in Dislocated Quasi Metric Space

In this paper, we prove a fixed point theorem in dislocated quasi-metric space which extends and unifies some well-known similar results in literature. Mathematics Subject Classification: 47H10, 54H25.

متن کامل

order intervals in the metric space of fuzzy numbers

in this paper, we introduce a function in order to measure the distancebetween two order intervals of fuzzy numbers, and show that this function isa metric. we investigate some properties of this metric, and finally presentan application. we think that this study could provide a more generalframework for researchers studying on interval analysis, fuzzy analysis andfuzzy decision making.

متن کامل

Clustering by density in any metric space

Given a distance matrix on X , establishing partitions (all the elements are clustered in disjoint classes) is generally made optimizing a criterion over the set of all the partitions with a number of classes that must be indicated. In this paper, we investigate a different approach. From the distance matrix, we first build a valued graph Γ = (X,E), for each vertex a density function De is eval...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2016

ISSN: 1877-0509

DOI: 10.1016/j.procs.2016.08.214